Fault-tolerant diameter for three family interconnection networks

نویسندگان

  • Tongliang Shi
  • Mei Lu
چکیده

Let G = (V ,E) be an k-connected graph. The (k − 1)-fault-tolerant diameter of G, denoted by Dk(G), is defined as Dk(G) = max{d(G − F)|F ⊂ V (G) and |F | = k − 1}, where G− F denotes the subgraph induced by V (G)− F . The fault-tolerant diameter is one important parameter for measuring the reliability and efficiency of interconnection networks. In this paper, we will give the bounds of fault-tolerant diameter of three family interconnection networks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computer Science Technical Report A New Family of Cayley Graph Interconnection Networks of Constant Degree Four

We propose a new family of interconnection networks that are Cayley graphs with constant node degree 4. These graphs are regular, have logarithmic diameter and are maximally fault tolerant. We investigate different algebraic properties of these networks (including fault tolerance) and propose optimal routing algorithms. As far as we know, this is the first family of Cayley graphs of constant de...

متن کامل

Generalized Shuffle - Exchange Networks : Combinatorial and Fault Tolerant Properties

Shuffle-exchange networks have been proposed as an attractive choice for interconnection networks. They have constant node degree and sublogarithmic diameter. Several researchers have studied various combinatorial and interconnection properties of them. In this paper, we generalize shuffle-exchange networks and define a new class of networks, called generalized shuffle-exchange network and deno...

متن کامل

Fault Tolerant Hierarchical Interconnection Network for Parallel Computers (fth)

In this paper we introduce a new interconnection network Fault Tolerant Hierarchical Interconnection network for parallel Computers denoted by FTH(k, 1).This network has fault tolerant hierarchical structure which overcomes the fault tolerant properties of Extended hypercube(EH).This network has low diameter, constant degree connectivity and low message traffic density in comparisons with other...

متن کامل

Hyper Butterfly Network: A Scalable Optimally Fault Tolerant Architecture

Bounded degree networks like deBruijn graphs or wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing nodes in the interconnection networks can have only a fixed number of I/O ports. One basic drawback of these networks is that they cannot provide a desired level of fault tolerance because of the bounded degree of th...

متن کامل

Optimal Constructions of Fault - Tolerant Multistage Interconnection Networks

In this paper we discover the family of Fault-Tolerant Multistage Interconnection Networks (MINs) that tolerates switch faults with a minimal number of redundant switching stages. While previously known constructions handled switch faults by eliminating complete stages, our approach is to bypass faulty switches by utilizing redundant paths. As a result, we are able to construct the rst known fa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Optim.

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2012